Using Utilization Pro les in Allocation and Partitioning for Multiprocessor Systems

The problems of multiprocessor partitioning and program allocation are interdependent and critical to the performance of multiprocessor systems Minimizing resource partitions for parallel programs on partitionable multiprocessors facilitates greater processor utilization and throughput The pro cessing resource requirements of parallel programs vary during program execution and are allocation dependent Optimal resource utilization requires that resource requirements be modeled as variable over time This paper investigates the use of program pro les in allocating programs and parti tioning multiprocessor systems An allocation method is discussed The goals of this method are to minimize program execution time minimize the total number of processors used characterize variation in processor requirements over the lifetime of a program to accurately predict the impact on run time of the number of processors available at any point in time and to minimize uctuations in processor requirements to facilitate e cient sharing of processors between partitions on a partitionable multiprocessor An application to program partitioning is discussed that improves partition run times compared to other methods Using Utilization Pro les in Allocation and Partitioning for Multiprocessor Systems John D Evans and Robert R Kessler April Abstract The problems of multiprocessor partitioning and program allocation are interdependent and critical to the performance of multiprocessor systems Minimizing resource partitions for parallel programs on partitionable multiprocessors facilitates greater processor utilization and throughput The processing resource requirements of parallel programs vary during program execution and are allocation dependent Optimal resource utilization requires that resource requirements be modeled as variable over time This paper investigates the use of program pro les in allocating programs and partitioning multiprocessor systems An allocation method is discussed The goals of this method are to minimize program execution time minimize the total number of processors used characterize variation in processor requirements over the lifetime of a program to accurately predict the impact on run time of the number of processors available at any point in time and to minimize uctuations in processor require ments to facilitate e cient sharing of processors between partitions on a partitionable multiprocessor An application to program partitioning is discussed that improves partition run times compared to other methodsThe problems of multiprocessor partitioning and program allocation are interdependent and critical to the performance of multiprocessor systems Minimizing resource partitions for parallel programs on partitionable multiprocessors facilitates greater processor utilization and throughput The processing resource requirements of parallel programs vary during program execution and are allocation dependent Optimal resource utilization requires that resource requirements be modeled as variable over time This paper investigates the use of program pro les in allocating programs and partitioning multiprocessor systems An allocation method is discussed The goals of this method are to minimize program execution time minimize the total number of processors used characterize variation in processor requirements over the lifetime of a program to accurately predict the impact on run time of the number of processors available at any point in time and to minimize uctuations in processor require ments to facilitate e cient sharing of processors between partitions on a partitionable multiprocessor An application to program partitioning is discussed that improves partition run times compared to other methods